Information erasure lurking behind measures of complexity
نویسندگان
چکیده
Karoline Wiesner, ∗ Mile Gu, Elisabeth Rieper, and Vlatko Vedral 4, 2 School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, United Kingdom Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, S15-03-18, Singapore 117543, Singapore Atomic and Laser Physics, Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Kingdom Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117543, Singapore (Dated: May 18, 2009)
منابع مشابه
A Study of Lurking Behavior: The Desire Perspective
Lurking behavior is common in information-seeking oriented communities. Transferring users with lurking behavior to be contributors can assist virtual communities to obtain competitive advantages. Based on the ecological cognition framework, this study proposes a model to examine the antecedents of lurking behavior in information-seeking oriented virtual communities. This study argues desire fo...
متن کاملSolving Shift Register Problems over Skew Polynomial Rings using Module Minimisation
For many algebraic codes the main part of decoding can be reduced to a shift register synthesis problem. In this paper we present an approach for solving generalised shift register problems over skew polynomial rings which occur in error and erasure decoding of `-Interleaved Gabidulin codes. The algorithm is based on module minimisation and has time complexity O(`μ) where μ measures the size of...
متن کاملAccumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
The paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the...
متن کاملErasure entropies and Gibbs measures
Recently Verdù and Weissman introduced erasure entropies, which are meant to measure the information carried by one or more symbols given all of the remaining symbols in the realization of a random process or field. A natural relation to Gibbs measures has also been observed. In this short note we study this relation further, review a few earlier contributions from statistical mechanics, and pr...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.2918 شماره
صفحات -
تاریخ انتشار 2009